35 research outputs found
Enhanced string factoring from alphabet orderings
In this note we consider the concept of alphabet ordering in the context of
string factoring. We propose a greedy-type algorithm which produces Lyndon
factorizations with small numbers of factors along with a modification for
large numbers of factors. For the technique we introduce the Exponent Parikh
vector. Applications and research directions derived from circ-UMFFs are
discussed.Comment: 9 page
CreaTology: Patterns in Digital Creative Arts
This special session presents research work on patterns in interdisciplinary areas, such as social network analyses, creative deception, and musicology with stringology. The work presented here is encouraging and opens up opportunities for potential further research and development
String Comparison in -Order: New Lexicographic Properties & On-line Applications
-order is a global order on strings related to Unique Maximal
Factorization Families (UMFFs), which are themselves generalizations of Lyndon
words. -order has recently been proposed as an alternative to
lexicographical order in the computation of suffix arrays and in the
suffix-sorting induced by the Burrows-Wheeler transform. Efficient -ordering
of strings thus becomes a matter of considerable interest. In this paper we
present new and surprising results on -order in strings, then go on to
explore the algorithmic consequences
Computation of the suffix array, burrows-wheeler transform and FM-index in V-order
V-order is a total order on strings that determines an instance of Unique Maximal Factorization Families (UMFFs), a generalization of Lyndon words. The fundamental V-comparison of strings can be done in linear time and constant space. V-order has been proposed as an alternative to lexicographic order (lexorder) in the computation of suffix arrays and in the suffix-sorting induced by the Burrows-Wheeler transform (BWT). In line with the recent interest in the connection between suffix arrays and Lyndon factorization, in this paper we obtain similar results for the V-order factorization. Indeed, we show that the results describing the connection between suffix arrays and Lyndon factorization are matched by analogous V-order processing. We also describe a methodology for efficiently computing the FM-Index in V-order, as well as V-order substring pattern matching using backward search
Analyzing strings with ordered Lyndon-like structures
No abstract availabl